Bridging, brokerage and betweenness
نویسندگان
چکیده
منابع مشابه
Bridging, brokerage and betweenness
Valente and Fujimoto (2010) proposed a measure of brokerage in networks based on Granovetter's classic work on the strength of weak ties. Their paper identified the need for finding node-based measures of brokerage that consider the entire network structure, not just a node's local environment. The measures they propose, aggregating the average change in cohesion for a node's links, has several...
متن کاملRoad Systems and Betweenness
A road system is a collection of subsets of a set—the roads—such that every singleton subset is a road in the system and every doubleton subset is contained in a road. The induced ternary (betweenness) relation is defined by saying that a point c lies between points a and b if c is an element of every road that contains both a and b. Traditionally, betweenness relations have arisen from a pleth...
متن کاملBrokerage Service
Brokers also realize a strategy for facing some of the current problems of software development and maintenance. They allow network-wide, transparent use of services. Thus, they support better use of resources [1,2] (for example, concerning performance, load balancing, etc.). Many distributed service extensions are based on brokerage services, for example startup services (as part of configurat...
متن کاملStabilizing brokerage.
A variety of social and economic arrangements exist to facilitate the exchange of goods, services, and information over gaps in social structure. Each of these arrangements bears some relationship to the idea of brokerage, but this brokerage is rarely like the pure and formal economic intermediation seen in some modern markets. Indeed, for reasons illuminated by existing sociological and econom...
متن کاملBetweenness Centrality - Incremental and Faster
We present an incremental algorithm that updates the betweenness centrality (BC) score of all vertices in a graph G when a new edge is added to G, or the weight of an existing edge is reduced. Our incremental algorithm runs in O(ν∗ · n) time, where ν∗ is bounded by m∗, the number of edges that lie on a shortest path in G. We achieve the same bound for the more general incremental vertex update ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Networks
سال: 2016
ISSN: 0378-8733
DOI: 10.1016/j.socnet.2015.09.001